#define _CRT_SECURE_NO_WARNINGS 1
#include"RBTree.h"

int main()
{
	RBTree<int,int> t;
	int arr[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	for (auto& e : arr)
	{
		if (e == 11)
		{
			int i = 0;
		}
		t.insert({ e,e });

	}
	t.InOrder();
	cout << t.IsValidRBTree() << endl;
	RBTree<int,int>::Node* left = t.leftMost();
	cout << left->_kv.first << endl;

	RBTree<int,int>::Node* right = t.rightMost();
	cout << right->_kv.first << endl;


	return 0;
}